Expressiveness of First-Order Description Logics

نویسندگان

  • Natasha Kurtonina
  • Maarten de Rijke
چکیده

We introduce a method for characterizing the expressive power of rst-order description logics. The method is essentially model-theoretic in nature in that it gives preservation results uniquely identifying a wide range of description logics as fragments of rst-order logic. The languages studied in the paper all belong to the well-known FL ? and AL hierarchies.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Classifying Description Logics

We describe a method for characterizing the expressive power of description logics. The method is essentially model-theoretic in nature, and it is applied to obtain expressiveness results for a wide range of logics in the well-known FL− and AL hierarchies. As a corollary we obtain a complete classification of the relative expressive power of these logics.

متن کامل

Expressiveness of Concept Expressions in First-Order Description Logics

We introduce a method for characterizing the expressive power of concept expressions in rst-order description logics. The method is essentially model-theoretic in nature in that it gives preservation results uniquely identifying a wide range of description logics as fragments of rst-order logic. The languages studied in the paper all belong to the well-known FL and AL hierarchies.

متن کامل

Comparing the Expressiveness of Description Logics

This work studies the expressiveness of the description logics that extend ALCreg (a variant of PDL) with any combination of the features: inverse roles, nominals, quantified number restrictions, the universal role, the concept constructor for expressing the local reflexivity of a role. We compare the expressiveness of these description logics w.r.t. concepts, positive concepts, TBoxes and ABox...

متن کامل

On the Relative Expressiveness of Second-Order Spider Diagrams and Regular Expressions

This paper is about spider diagrams, an extension of Euler diagrams that includes syntax to make assertions about set cardinalities. Like many diagrammatic logics, spider diagrams are a monadic and first-order, so they are inexpressive. The limitation to first-order precludes the formalisation of many fundamental concepts such as the cardinality of a set being even. To this end, second-order sp...

متن کامل

Translations: generalizing relative expressiveness between logics

There is a strong demand for precise means for the comparison of logics in terms of expressiveness both from theoretical and from application areas. The aim of this paper is to propose a sufficiently general and reasonable formal criterion for expressiveness, so as to apply not only to model-theoretic logics, but also to Tarskian and proof-theoretic logics. For model-theoretic logics there is a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997